Error bounds and a condition number for the absolute value equations
نویسندگان
چکیده
Abstract Due to their relation the linear complementarity problem, absolute value equations have been intensively studied recently. In this paper, we present error bound conditions for equations. Along with bounds, introduce a condition number. We consider general scaled matrix p-norms, as well particular p-norms. discuss basic properties of number, including its computational complexity. various bounds on and give exact formulae special classes matrices. Moreover, matrices that appear based transformation from problem. Finally, apply convergence analysis two methods solving
منابع مشابه
A new Levenberg-Marquardt approach based on Conjugate gradient structure for solving absolute value equations
In this paper, we present a new approach for solving absolute value equation (AVE) whichuse Levenberg-Marquardt method with conjugate subgradient structure. In conjugate subgradientmethods the new direction obtain by combining steepest descent direction and the previous di-rection which may not lead to good numerical results. Therefore, we replace the steepest descentdir...
متن کاملAbsolute Value Equations
We investigate existence and nonexistence of solutions for NP-hard equations involving absolute values of variables: Ax − |x| = b, where A is an arbitrary n × n real matrix. By utilizing an equivalence relation to the linear complementarity problem (LCP) we give existence results for this class of absolute value equations (AVEs) as well as a method of solution for special cases. We also give no...
متن کاملParticle Swarm Optimization for Absolute Value Equations
We investigate the NP-hard absolute value equation (AVE) Au |u| = b, where A is an arbitrary square matrix. In this paper, we present a smoothing method for the AVE. First, we replace the absolute value function by a smooth one, called aggregate function. With this smoothing technique, we formulate the non-smooth AVE as a smooth nonlinear equations, furthermore, an unconstrained differentiable ...
متن کاملSome lower bounds for the $L$-intersection number of graphs
For a set of non-negative integers~$L$, the $L$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $A_v subseteq {1,dots, l}$ to vertices $v$, such that every two vertices $u,v$ are adjacent if and only if $|A_u cap A_v|in L$. The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the ver...
متن کاملValidated Numerical Bounds on the Global Error for Initial Value Problems for Stiff Ordinary Differential Equations
Validated Numerical Bounds on the Global Error for Initial Value Problems for Stiff Ordinary Differential Equations Chao Yu Master of Science Graduate Department of Computer Science University of Toronto 2004 There are many standard numerical methods for initial value problems (IVPs) for ordinary differential equations (ODEs). Compared with these methods, validated methods for IVPs for ODEs pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2022
ISSN: ['0025-5610', '1436-4646']
DOI: https://doi.org/10.1007/s10107-021-01756-6